A novel progressively swarmed mixed integer genetic algorithm for security constrained optimal power flow (SCOPF)

نویسندگان

  • Mithun M. Bhaskar
  • Srinivas Muthyala
  • Maheswarapu Sydulu
چکیده

This paper proposes a superior Mixed Integer based hybrid Genetic Algorithm (MIGA) which inherits the advantages of binary and real coded Genetic Algorithm approach. The proposed algorithm is applied for the conventional generation cost minimization Optimal Power Flow (OPF) problem and for the Security Constrained Optimal Power Flow problem. Here, the main shortcoming with the conventional Genetic Algorithm, the ‘Hamming Cliff’ problem is addressed with Mixed Genetic Algorithm, which can overcome issues connected to the continuous search space. The proposed algorithm models the continuous variables using real values and discrete variables using binary values. A novel concept of Progressive filling is also presented here for Mixed Integer GA, which heightens the algorithm. The proposed procedure is compared with many conventional algorithms and validated on a test-bed of standard IEEE 30 bus system with and without valve-point loading effect.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhanced Genetic Algorithm Approach for Security Constrained Optimal Power Flow Including FACTS Devices

This paper presents a genetic algorithm based approach for solving security constrained optimal power flow problem (SCOPF) including FACTS devices. The optimal location of FACTS devices are identified using an index called overload index and the optimal values are obtained using an enhanced genetic algorithm. The optimal allocation by the proposed method optimizes the investment, taking into ac...

متن کامل

Novel Genetic Algorithm Based Solutions for Optimal Power Flow under Contingency Conditions

Power system throughout the world is undergoing tremendous changes and developments due to rapid Restructuring, Deregulation and Open-access policies. Greater liberalization, larger market and increasing dependency on the electricity lead to the system operators to work on limited spinning reserve and to operate on vicinities to maximize the economy compromising on the reliability and security ...

متن کامل

Security Constraint Optimal Power Flow (SCOPF) – A Comprehensive Survey

This paper reviews the existing developments in Security Constrained Optimal Power Flow (SCOPF) from 1960‟s to till date. Diverse schemes and approaches on Single Area/Multiarea, Algorithms, Contingency Selection, Steady and Dynamic SCOPF, Artificial Intelligence based SCOPF, Real time and SCOPF using Parallel/Distributed Processing, Economic Dispatch with Security Constraints, Decentralized SC...

متن کامل

A Mixed Integer Programming Approach to Optimal Feeder Routing for Tree-Based Distribution System: A Case Study

A genetic algorithm is proposed to optimize a tree-structured power distribution network considering optimal cable sizing. For minimizing the total cost of the network, a mixed-integer programming model is presented determining the optimal sizes of cables with minimized location-allocation cost. For designing the distribution lines in a power network, the primary factors must be considered as m...

متن کامل

Solving Very Large-scale Security-constrained Optimal Power Flow Problems by Combining Iterative Contingency Selection and Network Compression

This paper proposes a practical algorithm for solving very large-scale SCOPF problems, based on the combination of a contingency filtering scheme, used to identify the binding contingencies at the optimum, and a network compression method, used to reduce the complexity of the post-contingency models included in the SCOPF formulation. By combining these two complementary simplifications, it is p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999